Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
نویسندگان
چکیده
منابع مشابه
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm
Until recently, the fastest distributed MIS algorithm, even for simple graph classes such as unoriented trees that can contain large independent sets within neighborhoods, has been the simple randomized algorithm discovered independently by several researchers in the late 80s. This algorithm (commonly called Luby’s algorithm) computes an MIS of an n-node graph in O(logn) communication rounds (w...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملAn Improved Algorithm for Parallel Sparse LU Decomposition on a Distributed Memory Multiprocessor
In this paper we present a new parallel algorithm for the LU decomposition of a general sparse matrix Among its features are matrix redistribution at regular intervals and a dynamic pivot search strategy that adapts itself to the number of pivots produced Experimental results obtained on a network of transputers show that these features considerably improve the performance
متن کاملA Distributed Algorithm for Ear Decomposition
A distributed algorithm f o r finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the algorithm either the ears are correctly labeled o r the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messag...
متن کاملLess is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, research citation network analysis, social network analysis, and regulatory networks in genes. Low rank decompositions, such as SVD and CUR, are powerful techniques for revealing latent/hidden variables and associated pattern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2009
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-009-0088-2